Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
نویسندگان
چکیده
منابع مشابه
Batch scheduling to minimize maximum lateness
We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling
متن کاملScheduling on uniform parallel machines to minimize maximum lateness
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملStochastic Scheduling to Minimize Expected Lateness in Multiple Identical Machines
There are many real world problems in which parameters like the arrival time of new jobs, failure of resources, and completion time of jobs change continuously. This paper tackles the problem of scheduling jobs with random due dates on multiple identical machines in a stochastic environment. First to assign jobs to different machine centers LPT scheduling methods have been used, after that the ...
متن کاملCorrectness of the greedy algorithm for minimum lateness scheduling
We are given n jobs 1, 2, . . . n, and a release time r. Each job i has duration t(i) > 0 and deadline d(i). A schedule s defines, for each job i, a start time s(i) ≥ r so that for any two distinct jobs i and j the intervals [s(i), s[i] + t(i)] and [s(j), s(j) + t(j)] do not overlap (one finishes no later than the other starts). The lateness l(i) of job i in schedule s is the amount of time by ...
متن کاملAn Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
In this paper we present the Preemptive Minimize Maximum Lateness algorithm, an optimal parallel algorithm that schedules jobs for execution on a single processor machine with preemption. Each job is described by a release time, a deadline and a processing time. A job is considered late if it does not complete by its deadline and its lateness is defined as the difference between its completion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2013
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-013-9190-4